Energy-Efficient Scheduling of Periodic Real-Time Tasks over Homogeneous Multiprocessors
نویسنده
چکیده
Different from many previous energy-efficient scheduling studies, this paper explores energy-efficient multiprocessor scheduling of periodic real-time tasks with different power consumption functions. When the goal is on the minimization of energy consumption, we propose a 1.412approximation algorithm in the derivation of a feasible schedule. A series of simulation experiments was done for the performance evaluation of the proposed algorithm.
منابع مشابه
Pre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems
Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...
متن کاملPre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems
Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...
متن کاملEfficient and Flexible Fair Scheduling of Real-time Tasks on Multiprocessors
Anand Srinivasan Efficient and Flexible Fair Scheduling of Real-time Tasks on Multiprocessors (Under the direction of James H. Anderson) Proportionate fair (Pfair) scheduling is the only known way to optimally schedule periodic real-time task systems on multiprocessors in an on-line manner. Under Pfair scheduling, the execution of each task is broken into a sequence of quantum-length subtasks t...
متن کاملSafety Verification of Real Time Systems Serving Periodic Devices
In real-time systems response to a request from a controlled object must be correct and timely. Any late response to a request from such a device might lead to a catastrophy. The possibility of a task overrun, i.e., missing the deadline for completing a requested task, must be checked and removed during the design of such systems. Safe design of real-time systems running periodic tasks under th...
متن کاملT-L plane-based real-time scheduling for homogeneous multiprocessors
We consider optimal real-time scheduling of periodic tasks on multiprocessors—i.e., satisfying all task deadlines, when the total utilization demand does not exceed the utilization capacity of the processors. We introduce a novel abstraction for reasoning about task execution behavior on multiprocessors, called T-L plane and present T-L plane-based real-time scheduling algorithms. We show that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005